Transformations and confluence for rewrite systems
نویسندگان
چکیده
منابع مشابه
Confluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملConfluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether "joinabihty of critical pairs" is, ...
متن کاملConfluence of Layered Rewrite Systems
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal number of non-overlapping redexes along a path from the root to a leaf. Overlappings are allowed in finite or infinite trees. Rules may be non-terminating, non-l...
متن کاملHigher-Order Rewrite Systems and Their Confluence
We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning , and extend three connuence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, connuence of rewriting modulo equations a la Huet, an...
متن کاملConfluence of Terminating Conditional Rewrite Systems Revisited
We present a new and powerful criterion for connuence of terminating (terms in) join conditional term rewriting systems. This criterion is based on a certain joinability property for shared parallel critical peaks and does neither require the systems to be decreasing nor left-linear nor normal, but only terminating.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00255-0